Improving read mapping using additional prefix grams
نویسندگان
چکیده
منابع مشابه
Variant tolerant read mapping using min-hashing
DNA read mapping is a ubiquitous task in bioinformatics, and many tools have been developed to solve the read mapping problem. However, there are two trends that are changing the landscape of readmapping: First, new sequencing technologies provide very long reads with high error rates (up to 15%). Second, many genetic variants in the population are known, so the reference genome is not consider...
متن کاملImproving Mobile Web Navigation Using N-Grams Prediction Models
In this chapter, we propose to use N-gram models for improving Web navigation for mobile users. Ngram models are built from Web server logs to learn navigation patterns of mobile users. They are used as prediction models in an existing algorithm which improves mobile Web navigation by recommending shortcuts. Our experiments on two real data sets show that N-gram models are as effective as other...
متن کاملImproving System Performance by Using Prefix Adders in Rns
over the past few decades, the intense growth of portable communication devices leads to stringent need of efficient system performance. The system performance is upgraded by reducing the computation time. The Residue Number System performs the computations fast and makes use of the power and energy efficiently. In this paper, the modified prefix adders are proposed to perform the fast modulo c...
متن کاملUnfolding and Finite Prefix for Nets with Read Arcs
Petri nets with read arcs are investigated with respect to their unfolding, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled with loops in ordinary nets. The paper redeenes the concepts of a branching process and unfolding for nets with read arcs and proves that the set of reachable markings of a net is completely repre...
متن کاملAccurate Long-Read Alignment using Similarity Based Multiple Pattern Alignment and Prefix Tree Indexing
The ongoing research in sequencing technology has yielded in machines that are able to produce sequence data in the order of one billion base-pairs (bp) per machine day with an average read length of less than 100 bp per read (“short-reads”). In the past two years, many efficient algorithms have been developed for short-read alignment against a reference genome and for genome assembly, for an o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2014
ISSN: 1471-2105
DOI: 10.1186/1471-2105-15-42